Computing spanning line segments in three dimensions
نویسندگان
چکیده
منابع مشابه
Computing skeletons in three dimensions
Skeletonization will probably become as valuable a tool for shape analysis in 3D, as it is in 2D. We present a topology preserving 3D skeletonization method which computes both surface and curve skeletons whose voxels are labelled with the D6 distance to the original background. The surface skeleton preserves all shape information, so (close to) complete recovery of the object is possible. The ...
متن کاملFarthest - Site Voronoi Diagrams of Line Segments and Lines in Three and Higher Dimensions ∗
We show that the complexity of the farthest-site Voronoi diagram of n segments (or lines) in R is Θ(n) in the worst case, and it can be computed in O(n log n) time, using O(n) space. In R, the complexity of the diagram is Θ(nd−1) in the worst case.
متن کاملOn Farthest-Site Voronoi Diagrams of Line Segments and Lines in Three and Higher Dimensions∗
We show that the number of 3-dimensional cells in the farthest-site Voronoi diagram of n segments (or lines) in R is Θ(n) in the worst case, and that the diagram can be computed in O(k log n) time, where k is the complexity of the diagram, using O(k) space. In R, the number of d-dimensional cells in the diagram is Θ(nd−1) in the worst case.
متن کاملOn Computing Connected Components of Line Segments
It is shown that given a set of n line segments their connected components can be computed in time O n log n A bound of o n for this problem would imply a similar bound for detecting for a given set of n points and n lines whether some point lies on some of the lines This problem known as Hopcroft s problem is believed to have a lower bound of n For the special case when the endpoints of each s...
متن کاملA Characterization of Consistent Digital Line Segments in Two Dimensions
Our concern is the digitalization of line segments in Z as considered by Chun et al. [5] and Christ et al. [4]. The key property that differentiates the research of Chun et al. and Christ et al. from other research in digital line segment construction is that the intersection of any two segments must be connected. Such a system of segments is called a consistent digital line segments system (CD...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Visual Computer
سال: 1996
ISSN: 0178-2789,1432-2315
DOI: 10.1007/bf01782320